IMPLEMENTING HIRSCHBERG'S PRAM-ALGORITHM FOR CONNECTED COMPONENTS ON A GLOBAL CELLULAR AUTOMATON
نویسندگان
چکیده
منابع مشابه
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملAnother Pram Algorithm for Finding Connected Components of Sparse Graphs
We present an algorithm which exploits a new approach to the problem of nding the connected components of an undirected graph, CCug for short, with v vertices and e edges. The algorithm has depth O(log 2 (e)) 1 on a CREW PRAM using e processors, hence its cost is not aaected by the number v of graph vertices. This makes the algorithm the one with best speedup and best cost for CCug on highly sp...
متن کاملa cellular automaton based algorithm for mobile sensor gathering
in this paper we proposed a cellular automaton based local algorithm to solve the autonomously sensor gathering problem in mobile wireless sensor networks (mwsn). in this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. the sensors decide to move only based on their local information. cellular automaton (ca) as dynamical sy...
متن کاملA 2D Cellular Automaton Biofilm Detachment Algorithm
A cellular-automaton based two-dimensional biofilm detachment module is developed. The module is an improvement of previously presented methodologies for modeling biofilm detachment under the influence of hydrodynamic forces of the moving fluid in which biofilm develops. It uses biofilm mechanical properties that are variable in time and space and are determined by the percentage of each biofil...
متن کاملA Parallel Algorithm for Connected Components on Distributed Memory Machines
Finding connected components (CC) of an undirected graph is a fundamental computational problem. Various CC algorithms exist for PRAM models. An implementation of a PRAM CC algorithm on a coarse-grain MIMD machine with distributed memory brings many problems, since the communication overhead is substantial compared to the local computation. Several implementations of CC algorithms on distribute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2008
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054108006297